import java.util.Comparator;
import java.util.PriorityQueue;

public class Test {
    public static void main(String[] args) {
        Solution solution=new Solution();
        int [] arr=new int[]{5,3,1,1,1,3,73,1 };
        solution.topKFrequent(arr,2);
    }
    public static void main1(String[] args) {
        String s="hello word";
        String [] arr=s.split(" ");
        String ret;
        int a=Integer.MIN_VALUE;
        PriorityQueue<Integer> queue =new PriorityQueue<>(new Comparator<Integer>() {
            @Override
            public int compare(Integer o1, Integer o2) {
                return o2-o1;
            }
        });
    }
}
